Capacity-Approaching Joint Source-Channel Coding for Asymmetric Channels with Low-Density Parity-Check Codes
نویسنده
چکیده
By only sending the parity bits, joint source-channel coding can be natively achieved with lowdensity parity-check codes. However, the code ensemble design of optimal low-density parity-check codes for joint source-channel coding over asymmetric communication channels is difficult. To circumvent such a difficulty, source-channel adaptors is proposed in this paper. By using the source-channel adaptors both the asymmetric communication channel and the asymmetric correlation channel can be converted to symmetric channel and the conventional design method for channel coding can be used straightforwardly. To demonstrate the effectiveness of the proposed scheme, a code ensemble for joint source-channel coding over asymmetric communication channel is designed for binary memoryless sources with a range of a prior probability. The experiment results show that the performance of the devised codes is very close to the theory limit. Copyright © 2014 IFSA Publishing, S. L.
منابع مشابه
Approaching the Slepian-Wolf Limit with LDPC Coset Codes
We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...
متن کاملStatistical mechanics of LDPC codes on channels with memory
Introduction. – A common problem in modern mobile telecommunication systems is that the strength of the signal varies over time as a result of e.g. the motion of the receiver with respect to the source and the varying number of obstacles that shadow the signal over time. Channels describing communication of attenuated signals are termed ‘fading channels’. Fading channels are modeled by finite-s...
متن کاملDistributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic coding”, which exploits the fact that arithmetic codes are good source as well as channel codes. In particular, we propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along wit...
متن کاملAchieving the capacity of half-duplex degraded relay channels using polar coding
Channel capacity; Decode-and-forward; Half-duplex; Iterative decoding; Polar coding; Relay channel Abstract In this paper, a novel transmission protocol based on polar coding is proposed for the half-duplex degraded relay channel. In the proposed protocol, referred to as the partial message relaying, the relay only needs to forward a part of the decoded source message that the destination needs...
متن کامل11: Advancing Underwater Acoustic Communication for Autonomous Distributed Networks via Sparse Channel Sensing, Coding, and Navigation Support
1. Advanced communication techniques of sparse channel sensing and nonbinary LDPC coding. Underwater acoustic channels are naturally sparse, but how to effectively exploit the sparsity is a challenging task. We will investigate the recently developed “compressive sensing” algorithms for sparse channel estimation in the context of multicarrier acoustic communications. On the other hand, channel ...
متن کامل